Visualizing Rank Deficient Models: A Row Equation Geometry of Rank Deficient Matrices and Constrained-Regression
نویسندگان
چکیده
منابع مشابه
Visualizing Rank Deficient Models: A Row Equation Geometry of Rank Deficient Matrices and Constrained-Regression
Situations often arise in which the matrix of independent variables is not of full column rank. That is, there are one or more linear dependencies among the independent variables. This paper covers in detail the situation in which the rank is one less than full column rank and extends this coverage to include cases of even greater rank deficiency. The emphasis is on the row geometry of the solu...
متن کاملRank-deficient submatrices of Fourier matrices
We consider the maximal rank-deficient submatrices of Fourier matrices. We do this by considering a hierarchical subdivision of these matrices into low rank blocks. We also explore some connections with the FFT, and with an uncertainty principle for Fourier transforms over finite Abelian groups.
متن کاملRank-deficient submatrices of Kronecker products of Fourier matrices
We provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrices A ⊗ B, and in particular the Kronecker product of Fourier matrices F = Fn1 ⊗ . . . ⊗ Fnk . We show how in the latter case, maximal rank-deficient submatrices can be constructedas tilings of rank-one blocks. Such tilings exist for any subgroup of a suitable Abelian group associated to the matrix F . The...
متن کاملRecurrent Neural Networks for Computing Pseudoinverses of Rank-Deficient Matrices
Three recurrent neural networks are presented for computing the pseudoinverses of rank-deficient matrices. The first recurrent neural network has the dynamical equation similar to the one proposed earlier for matrix inversion and is capable of Moore–Penrose inversion under the condition of zero initial states. The second recurrent neural network consists of an array of neurons corresponding to ...
متن کاملOptimal Weighted Matchings for Rank-Deficient Sparse Matrices
The maximum matching of a sparse matrix A that maximizes the product of the matched entries can be used to increase the speed and reliability of sparse linear algebra operations. One popular method of solution is to transform to an assignment problem and to use a sparse variant of the Hungarian algorithm. If A is structurally rank deficient this approach chooses a set I × J of rows and columns ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0038923